Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Trajectory privacy protection method based on district partitioning
GUO Liangmin, WANG Anxin, ZHENG Xiaoyao
Journal of Computer Applications    2018, 38 (11): 3263-3269.   DOI: 10.11772/j.issn.1001-9081.2018050975
Abstract604)      PDF (1029KB)(366)       Save
Aiming at the vulnerability to continuous query attacks in the methods based on k-anonymity and difficultly in constructing anonymous region when the number of users is few, a method for trajectory privacy protection based on district partitioning was proposed. A user-group that has the history query points of a particular district was obtained by using a third-party auxiliary server, and the historical query points were downloaded from the users in the user-group by P2P protocol. Then the query result was searched in the historical query information to improve the query efficiency. In addition, a pseudo query point was sent to confuse attackers, and the multiple query points were hidden in the same sub-district by district partitioning to keep the attackers from reconstructing real trajectory of the user to ensure security. The experimental results show that the proposed method can improve the security of user trajectory privacy with the increases of distance and cache time. Compared to the Collaborative Trajectory Privacy Preserving (CTPP) method, when the number of users is 1500, the security is averagely increased about 50% and the query efficiency is averagely improved about 35% (the number of sub-districts is 400).
Reference | Related Articles | Metrics